Network flow problem - PDFSEARCH.IO - Document Search Engine

Network flow problem
Results: 219

#	Item
71	PDF Document Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:11 Theoretical computer science Maximum flow problem Flow network Minimum-cost flow problem Ford–Fulkerson algorithm Edmonds–Karp algorithm Shortest path problem Matching Max-flow min-cut theorem Graph theory Mathematics Network flow
72	Graph Cuts is a Max-Product Algorithm Daniel Tarlow, Inmar E. Givoni, Richard S. Zemel, Brendan J. Frey University of Toronto Toronto, ON M5S 3G4 {dtarlow@cs, inmar@psi, zemel@cs, frey@psi}.toronto.edu Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-07-15 18:06:25 Operations research Graphical models Submodular set function Belief propagation Maximum flow problem Factor graph Tree decomposition Algorithm Linear programming Graph theory Mathematics Network flow
73	Flexible Graph Partitioning of Power Grids with Peer-to-peer Electricity Exchange Kazuhiro Minami, Tomoya Tanjo, Nana Arizumi, Hiroshi Maruyama Institute of Statistical Mathematics, Tokyo, Japan Email: {kminami, tanjo, a Add to Reading List Source URL: systemsresilience.org Language: English - Date: 2014-12-15 22:25:12 Network flow NP-complete problems Graph partition Graph operations Maximum flow problem Topology Flow network Connectivity Planar separator theorem Graph theory Theoretical computer science Mathematics
74	28.5 Social Networks,292 0 Elsevier Sequoia S.A., Lausanne - Printed in the Netherlands The Medieval River Trade Network of Russia Add to Reading List Source URL: www.analytictech.com Language: English - Date: 2008-10-07 14:37:40 Theoretical computer science Networks Network analysis Algebraic graph theory Centrality Distance Moscow Shortest path problem Flow network Graph theory Mathematics Network theory
75	Graph Evolution: Densification and Shrinking Diameters JURE LESKOVEC Carnegie Mellon University JON KLEINBERG Cornell University Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-04-26 12:21:27 Network theory Evolving networks Small-world network Degree distribution Random graph Centrality Shortest path problem Graph Flow network Graph theory Mathematics Networks
76	Flows Advanced Algorithms – COMS31900 G = (V, E) is a directed graph with two special vertices s and t, where s is the source and t is the target. We write u → v to denote the directed edge from u to v . Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Combinatorics Combinatorial optimization Maximum flow problem Flow network Ford–Fulkerson algorithm Max-flow min-cut theorem Cut Minimum cut Shortest path problem Network flow Graph theory Mathematics
77	Advanced Algorithms – COMS31900Lecture 15 Maximum flows and minimum cuts Markus Jalsenius Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Combinatorics Flow network Maximum flow problem Push-relabel maximum flow algorithm Ford–Fulkerson algorithm Network flow Graph theory Mathematics
78	Specification Inference Using Context-Free Language Reachability Osbert Bastani Saswat Anand Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-02-24 02:42:36 Mathematics Combinatorics Flow network Dynamic programming Maximum flow problem Graph theory Network flow Operations research
79	Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost Andreas Krause Carlos Guestrin Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-25 23:20:28 Operations research Spanning tree Network flow Minimum spanning tree Submodular set function Flow network Wireless sensor network Shortest path problem Graph theory Mathematics Theoretical computer science
80	Delay and Buffer Bounds in High Radix Interconnection Networks Abstract queues is a known hard problem. The difficulty in analysis primarily arises from the fact that the traffic processes do Add to Reading List Source URL: cva.stanford.edu Language: English - Date: 2005-12-01 13:38:05 Electronic engineering Queuing delay Quality of service Traffic flow Queueing theory Throughput Leaky bucket TCP global synchronization Network performance Statistics Management

UPDATE